s = input()
n = int(input())
words = []
for _ in range(n):
line = input()
if line.startswith(s):
words.append(line)
if len(words) > 0:
print(min(words))
else:
print(s)
#include<bits/stdc++.h>
typedef unsigned long long ll;
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
ios::sync_with_stdio(0);cin.tie(0);
string s;
ll n;
cin>>s>>n;
string tx[n];
for(ll i=0;i<n;++i){cin>>tx[i];}
string ans="";
for(ll i=0;i<n;++i){
for(ll j=0;j<s.size();++j){
if(s[j]!=tx[i][j]){break;}
if(j==s.size()-1){
if(ans==""){
ans=tx[i];
break;
}
ans=min(ans,tx[i]);
}
}
}
if(ans==""){ans=s;}
cout<<ans;
return 0;
}2099. Find Subsequence of Length K With the Largest Sum | 1608A - Find Array |
416. Partition Equal Subset Sum | 1446. Consecutive Characters |
1618A - Polycarp and Sums of Subsequences | 1618B - Missing Bigram |
938. Range Sum of BST | 147. Insertion Sort List |
310. Minimum Height Trees | 2110. Number of Smooth Descent Periods of a Stock |
2109. Adding Spaces to a String | 2108. Find First Palindromic String in the Array |
394. Decode String | 902. Numbers At Most N Given Digit Set |
221. Maximal Square | 1200. Minimum Absolute Difference |
1619B - Squares and Cubes | 1619A - Square String |
1629B - GCD Arrays | 1629A - Download More RAM |
1629C - Meximum Array | 1629D - Peculiar Movie Preferences |
1629E - Grid Xor | 1629F1 - Game on Sum (Easy Version) |
2148. Count Elements With Strictly Smaller and Greater Elements | 2149. Rearrange Array Elements by Sign |
2150. Find All Lonely Numbers in the Array | 2151. Maximum Good People Based on Statements |
2144. Minimum Cost of Buying Candies With Discount | Non empty subsets |